Divide-and-Conquer Matrix Factorization

نویسندگان

  • Lester W. Mackey
  • Ameet Talwalkar
  • Michael I. Jordan
چکیده

This work introduces Divide-Factor-Combine (DFC), a parallel divide-andconquer framework for noisy matrix factorization. DFC divides a large-scale matrix factorization task into smaller subproblems, solves each subproblem in parallel using an arbitrary base matrix factorization algorithm, and combines the subproblem solutions using techniques from randomized matrix approximation. Our experiments with collaborative filtering, video background modeling, and simulated data demonstrate the near-linear to super-linear speed-ups attainable with this approach. Moreover, our analysis shows that DFC enjoys high-probability recovery guarantees comparable to those of its base algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Divide-and-Conquer Method for the Takagi Factorization

This paper presents a divide-and-conquer method for computing the Takagi factorization, or symmetric singular value decomposition, of a complex symmetric and tridiagonal matrix. An analysis of accuracy shows that our method produces accurate Takagi values and orthogonal Takagi vectors. Our preliminary numerical experiments have confirmed our analysis and demonstrated that our divide-and-conquer...

متن کامل

Parallel Algorithm for Symmetric Positive Definite Banded Linear Systems: A Divide and Conquer Approach

The WZ factorization for the solution of symmetric positive definite banded linear systems when combined with a partitioned scheme, renders a divide and conquer algorithm. The WZ factorization of the coefficient matrix in each block has the properties: the vector [a1, . . . , aβ , 0, . . . , 0, an−β+1, . . . , an] is invariant under the transformation W where β is the semibandwidth of the coeff...

متن کامل

New Variants of Divide & Conquer Method Arisingfrom Block Cyclic Reduction Type FormulationTuomo

The Divide & Conquer fast direct method for solving the Poisson equation in rectangular domains is formulated in the classical block cyclic reduction manner, demonstrating the close relationship between the two approaches. Diierent ways of solving the arising reduced systems are considered. The partial solution approach leads to the standard Divide & Conquer method, while the new variants are o...

متن کامل

A Parallel Fast Direct Solver for Block Tridiagonal Systemswith

A parallel fast direct solver based on the Divide & Conquer method for linear systems with separable block tridiagonal matrices is considered. Such systems appear, for example, when discretizing the Poisson equation in a rectangular domain using the ve{point nite diierence scheme or the piecewise linear nite elements on a triangulated rectangular mesh. The Divide & Conquer method has the arithm...

متن کامل

A new approach for building recommender system using non negative matrix factorization method

Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is ​​decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011